Enhanced applicability of loop transformations

نویسنده

  • Martin Palkovič
چکیده

• A submitted manuscript is the author's version of the article upon submission and before peer-review. There can be important differences between the submitted version and the official published version of record. People interested in the research are advised to contact the author for the final version of the publication, or visit the DOI to the publisher's website. • The final author version and the galley proof are versions of the publication after peer review. • The final published version features the final layout of the paper including the volume, issue and page numbers.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Adaptive loop transformations for scientific programs

To facilitate the eecient execution of scientiic programs , parallelizing compilers apply a wide range of loop transformations. In some situations it may not be possible to determine the applicability and usefulness of the transformations at compile-time. In this paper we develop adaptive versions of various loop transformations which lend themselves to eecient application at run-time. Instead ...

متن کامل

Array Restructuring for Cache Locality

Array Restructuring for Cache Locality by Shun-Tak Albert Leung Chairperson of Supervisory Committee: Professor John Zahorjan Department of Computer Science and Engineering Caches are used in almost every modern processor design to reduce the long memory access latency, which is increasingly a bottleneck to program performance. For caches to be effective, programs must exhibit good data localit...

متن کامل

Foundations for a Practical Theory of Program Refinement and Transformation

A wide spectrum language is presented, which is designed to facilitate the proof of the correctness of refinements and transformations. Two different proof methods are introduced and used to prove some fundamental transformations, including a general induction rule (Lemma 3.9) which enables transformations of recursive and iterative programs to be proved by induction on their finite truncations...

متن کامل

The New Framework for Loop Nest Optimization in GCC: from Prototyping to Evaluation

This paper presents a practical prototyping tool for SSA transformations based on PROLOG, and a case study of its applicability using the New Framework for Loop Nest Optimization of the GNU Compiler Collection (GCC). Using this approach, we implemented an induction variable analysis in GCC and performed several experiments for assessing different issues: performance of the generated code, effec...

متن کامل

Effects of integrating physical and financial flows through a closed-loop supply chain network under uncertain demand and return

The impact of financial challenges on the profit of a supply chain, have caused the researcher to model the supply chain network by considering the operational and financial dimensions. Also, the establishment of a closed loop supply chain (CLSC) network has a high effect on economic profit. So, the purpose of this study is to design a stochastic closed loop supply chain network by considering ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2007